Minimal Systems of Binomial Generators and the Indispensable Complex of a Toric Ideal

نویسنده

  • HARA CHARALAMBOUS
چکیده

Let A = {a1, . . . , am} ⊂ Z be a vector configuration and IA ⊂ K[x1, . . . , xm] its corresponding toric ideal. We completely determine the number of different minimal systems of binomial generators of IA. We also prove that generic toric ideals are generated by indispensable binomials. We associate to A a simplicial complex ∆ind(A). We show that the vertices of ∆ind(A) correspond to the indispensable monomials of the toric ideal IA, while one dimensional facets of ∆ind(A) with minimal binomial A-degree correspond to the indispensable binomials of IA. This talk is based on joint work with A. Katsabekis and A. Thoma.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matroid Toric Ideals: Complete Intersection, Minors, and Minimal Systems of Generators

In this paper, we investigate three problems concerning the toric ideal associated to a matroid. Firstly, we list all matroids M such that its corresponding toric ideal IM is a complete intersection. Secondly, we handle the problem of detecting minors of a matroidM from a minimal set of binomial generators of IM. In particular, given a minimal set of binomial generators of IM we provide a neces...

متن کامل

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Indispensable monomials of toric ideals and Markov bases

Extending the notion of indispensable binomials of a toric ideal ([14], [7]), we define indispensable monomials of a toric ideal and establish some of their properties. They are useful for searching indispensable binomials of a toric ideal and for proving the existence or non-existence of a unique minimal system of binomials generators of a toric ideal. Some examples of indispensable monomials ...

متن کامل

Indispensable monomials of toric ideals and Markov bases

Extending the notion of indispensable binomials of a toric ideal ((14), (7)), we define indispensable monomials of a toric ideal and establish some of their properties. They are useful for searching indispensable binomials of a toric ideal and for proving the existence or non-existence of a unique minimal system of binomials generators of a toric ideal. Some examples of indispensable monomials ...

متن کامل

Arithmetical Rank of Toric Ideals Associated to Graphs

Let IG ⊂ K[x1, . . . , xm] be the toric ideal associated to a finite graph G. In this paper we study the binomial arithmetical rank and the Ghomogeneous arithmetical rank of IG in 2 cases: (1) G is bipartite, (2) IG is generated by quadratic binomials. In both cases we prove that the binomial arithmetical rank and the G-arithmetical rank coincide with the minimal number of generators of IG.

متن کامل

Matchings in simplicial complexes, circuits and toric varieties

Using a generalized notion of matching in a simplicial complex and circuits of vector configurations, we compute lower bounds for the minimum number of generators, the binomial arithmetical rank and the A-homogeneous arithmetical rank of a lattice ideal. Prime lattice ideals are toric ideals, i.e. the defining ideals of toric varieties. © 2006 Elsevier Inc. All rights reserved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006